Occurrences of palindromes in characteristic Sturmian words

نویسنده

  • Amy Glen
چکیده

This paper is concerned with palindromes occurring in characteristic Sturmian words cα of slope α, where α ∈ (0, 1) is an irrational. As cα is a uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα with bounded gaps. Our aim is to completely describe where palindromes occur in cα. In particular, given any palindromic factor u of cα, we shall establish a decomposition of cα with respect to the occurrences of u. Such a decomposition shows precisely where u occurs in cα, and this is directly related to the continued fraction expansion of α.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sturmian numeration systems and decompositions to palindromes

We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number n better reflect the structure of the associated Sturmian word. In particular, this extended numeration system helps to catch occurrences of palindromes in a characteristic Sturmian words and thus to prove for Sturmian w...

متن کامل

A Classification of Trapezoidal Words

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n≥ 0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open...

متن کامل

Palindromes in Sturmian Words

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

متن کامل

Combinatorial Properties of Sturmian Palindromes

We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

متن کامل

Rich, Sturmian, and trapezoidal words

In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 352  شماره 

صفحات  -

تاریخ انتشار 2006